Extending Tree Kernels with Topological Information
نویسندگان
چکیده
The definition of appropriate kernel functions is crucial for the performance of a kernel method. In many of the state-of-the-art kernels for trees, matching substructures are considered independently from their position within the trees. However, when a match happens in similar positions, more strength could reasonably be given to it. Here, we give a systematic way to enrich a large class of tree kernels with this kind of information without affecting, in almost all cases, the worst case computational complexity. Experimental results show the effectiveness of the proposed approach.
منابع مشابه
Tree Kernel-Based Relation Extraction with Context-Sensitive Structured Parse Tree Information
This paper proposes a tree kernel with contextsensitive structured parse tree information for relation extraction. It resolves two critical problems in previous tree kernels for relation extraction in two ways. First, it automatically determines a dynamic context-sensitive tree span for relation extraction by extending the widely-used Shortest Path-enclosed Tree (SPT) to include necessary conte...
متن کاملImproving Machine Translation Quality Prediction with Syntactic Tree Kernels
We investigate the problem of predicting the quality of a given Machine Translation (MT) output segment as a binary classification task. In a study with four different data sets in two text genres and two language pairs, we show that the performance of a Support Vector Machine (SVM) classifier can be improved by extending the feature set with implicitly defined syntactic features in the form of...
متن کاملExtending Tree Kernels Towards Paragraphs
We extend parse tree kernels from the level of individual sentences towards the level of paragraph to build a framework for learning short texts such as search results and social profile postings. We build a set of extended trees for a paragraph of text from the individual parse trees for sentences. It is performed based on coreferences and Rhetoric Structure relations between the phrases in di...
متن کاملWeisfeiler-Lehman Graph Kernels
In this article, we propose a family of efficient kernels for large graphs with discrete node labels. Key to our method is a rapid feature extraction scheme based on the Weisfeiler-Lehman test of isomorphism on graphs. It maps the original graph to a sequence of graphs, whose node attributes capture topological and label information. A family of kernels can be defined based on this Weisfeiler-L...
متن کاملDetermination of Nutritional Value and Oxidative Stability of Fresh Walnut
Walnut (Juglans regia L.) is a tree with significant economic value and usage for human health and various food industries. However, fresh walnut kernels are a less widespread product than the dried kernels. This study aimed to determine the fresh walnut kernel properties including, fatty acid composition, proximate composition, total phenolics (TPs), total antioxidant capacity (TAC), acidic, p...
متن کامل